Automated Task Allocation for Network Processors
نویسندگان
چکیده
Network processors have great potential to combine high performance with increased flexibility. These multiprocessor systems consist of programmable elements, dedicated logic, and specialized memory and interconnection networks. However, the architectural complexity of the systems makes programming difficult. Programmers must be able to productively implement high performance applications for network processors to succeed. Ideally, designers describe applications in a domain specific language (DSL). DSLs expedite the development process by providing component libraries, communication and computation semantics, visualization tools, and test suites for an application domain. An integral aspect of mapping applications described in a DSL to network processors is allocating computational tasks to processing elements. We formulate this task allocation problem for a popular network processor, the Intel IXP1200. This method proves to be computationally efficient and produces results that are within 5% of aggregate egress bandwidths achieved by hand-tuned implementations on two representative applications: IPv4 forwarding and DiffServ.
منابع مشابه
Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملTask Allocation Algorithm through Minimizing Processing Cost in Distributed Network
A distributed network consists of multiple autonomous computers that communicate through a communication media. In distributed network in which a task is divided into many fractions and each of which is to be get processed. The task allocation problem can be explained in terms of number of tasks and number of processors available. According to the task allocation problem if the number of task a...
متن کاملCost Optimization of Distributed Computing System with Dynamic Re-Allocation
A Distributed Computing System (DCS) is a combination of application and system programs that exchanges data across a number of independent terminals connected by a communication network. Cost optimization in DCS can be achieve by optimize the performance of DCS. In task allocation two types of approaches are available and these are dynamic and static. Dynamic approach of task allocation is muc...
متن کاملReview of “C Compiler Design for a Network Processor”
This review describes the approach and results from the paper by Wagner and Leupers [1]. The methods they have developed for compilers for application specific instruction set processors (ASIPs) and specifically network processors (NPs) with bit-packet addressing are mainly concentrated to extensions to the traditional register allocation by graph coloring. ASIPs are used in areas where general...
متن کاملAmalysis, Evaluation, and Comparison of Algorithms for Scheduling Task Graphs on Parallel Processors
In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macrodataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms and classify them into four groups. The first group includes algorithms that schedule the DAG to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004